The Computational Complexity of Quanti ed Reciprocals

نویسندگان

  • Jakub Szymanik
  • Johan van Benthem
  • Nina Gierasimczuk
  • Theo Janssen
  • Marcin Mostowski
  • Jouko Väänänen
چکیده

We study the computational complexity of reciprocal sentences with quanti ed antecedents. We observe a computational dichotomy between di erent interpretations of reciprocity, and shed some light on the status of the so-called Strong Meaning Hypothesis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Computational Complexity of Quantified Reciprocals

We study the computational complexity of reciprocal sentences with quanti ed antecedents. We observe a computational dichotomy between di erent interpretations of reciprocity, and shed some light on the status of the so-called Strong Meaning Hypothesis.

متن کامل

Improved Algorithms for Sign Determination and Existential Quantifier Elimination

Recently there has been a lot of activity in algorithms that work over real closed elds, and that perform such calculations as quanti er elimination or computing connected components of semi-algebraic sets. A cornerstone of this work is a symbolic sign determination algorithm due to Ben-Or, Kozen and Reif [2]. In this paper we describe a new sign determination method based on the earlier algori...

متن کامل

A miniKanren Interactive Proof System for Deciding the Truth of (simple) Quanti ed Boolean Formulae

We present an application of miniKanren with respect to the needs of Proof and Complexity Theories. We implement an Interactive Proof System for deciding the truth of quanti ed boolean formulae, which completes the proof that the complexity classes IP(class of problems solvable by an interactive proof system) and PSPACE(class of decision problems requiring polynomial space, but may need exponen...

متن کامل

Providing Better Support for Quanti ed Queries

Relational database systems do not e ectively support complex queries containing quanti ers (quanti ed queries) that are increasingly becoming important in decision support applications. Generalized quanti ers provide an e ective way of expressing such queries naturally. In this paper, we consider the problem of processing quanti ed queries within the generalized quanti er framework. We demonst...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008